Gray codes for reflection groups
نویسندگان
چکیده
Let G be a finite group generated by reflections. It is shown that the elements of G can be arranged in a cycle (a "Gray. code") such that each element is obtained from the previous one by applying one of the generators. The case G = d[ ' yields a conventional binary Gray code. These generalized Gray codes provide an efficient wa), to run through the elements of any finite reflection group.
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملGRAY ISOMETRIES FOR FINITE p-GROUPS
We construct two classes of Gray maps, called type-I Gray map and type-II Gray map, for a finite p-group G. Type-I Gray maps are constructed based on the existence of a Gray map for a maximal subgroup H of G. When G is a semidirect product of two finite p-groups H and K, both H and K admit Gray maps and the corresponding homomorphism ψ : H −→ Aut(K) is compatible with the Gray map of K in a sen...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملGloss and Normal Map Acquisition Using Gray Codes
We build on our previously proposed method [Francken et al. 2008], which acquires normal maps by analyzing the reflection of binary patterns (Gray codes). These patterns are successively refined in this process. The key idea in this paper, is that this refinement also allows us to measure the shininess for each spatial location, resulting in a gloss map. Acquiring spatially varying reflectance ...
متن کاملGroup Codes based on Wreath Products of Complex Reflection Groups
Group codes based on wreath products of complex matrix groups are constructed. Efficient algorithms for encoding and decoding these codes are described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 5 شماره
صفحات -
تاریخ انتشار 1989